Applications of Multiple Trust Authorities in Pairing Based Cryptosystems
نویسندگان
چکیده
We investigate a number of issues related to the use of multiple trust authorities and multiple identities in the type of identifier based cryptography enabled by the Weil and Tate pairings. An example of such a system is the Boneh and Franklin encryption scheme. We present various applications of multiple trust authorities. In particular we focus on how one can equate a trust authority with a way to add contextual information to an identity.
منابع مشابه
Identity Based Encryption Using Multiple Trust Authorities in Ad Hoc Networks
Ad hoc networks are becoming more and more popular as the use of mobile computing devices increases. While ad hoc networks have many advantageous properties, they also pose several security challenges which are unique to networks of this kind. One of the main challenges that ad hoc networks have to face is authentication. Authentication is difficult to achieve in ad hoc networks because some ty...
متن کاملSecure Key Issuing in ID-based Cryptography
ID-based cryptosystems have many advantages over PKI based cryptosystems in key distribution, but they also have an inherent drawback of key escrow problem, i.e. users’ private keys are known to the key generation center (KGC). Therefore secure key issuing (SKI) is an important issue in ID-based cryptography. In multiple authority approach (Boneh & Franklin 2001, Chen et al. 2002), key generati...
متن کاملCertification of Public Keys within an Identity Based System
We investigate a number of issues related to the use of multiple trust authorities in the type of identifier based cryptography enabled by the Weil and Tate pairings. An example of such a system is the Boneh and Franklin encryption scheme. We examine how to create an efficient hierarchy of multiple trust authorities and then go on to examine some application areas of pairing based cryptography.
متن کاملEfficient Implementation of the Pairing on Mobilephones Using BREW
Pairing based cryptosystems can accomplish novel security applications such as ID based cryptosystems which have not been con structed e ciently without the pairing The processing speed of the pair ing based cryptosystems is relatively slow compared with the other con ventional public key cryptosystems However several e cient algorithms for computing the pairing have been proposed namely Duursm...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002